Cycles in the Graph of Overlapping Permutations Avoiding Barred Patterns

As a variation of De Bruijn graphs on strings of symbols, the graph of overlapping permutations has a directed edge π(1)π(2) . . . π(n+1) from the standardization of π(1)π(2) . . . π(n) to the standardization of π(2)π(3) . . . π(n + 1). In this paper, we consider the enumeration of d-cycles in the subgraph of overlapping (231, 41̄32)avoiding permutations. To this end, we introduce the notions of marked Motzkin paths and marked Riordan paths, where a marked Motzkin (resp. Riordan) path is a Motzkin (resp. Riordan) path in which exactly one step before the leftmost return point is marked. We show that the number of closed walks of length d in the subgraph of overlapping (231, 41̄32)-avoiding permutations are closely related to the number of marked Motzkin paths and that of marked Riordan paths. By establishing bijections, we get the enumerations of marked Motzkin paths and marked Riordan paths. As a corollary, we provide bijective proofs of two identities involving Catalan numbers in answer to the problem posed by Ehrenborg, Kitaev and Steingŕımsson. Moreover, we get the enumerations of (231, 41̄32)-avoiding affine permutations and (312, 324̄1)-avoiding affine permutations.